On Weak Circular Squares in Binary Words
نویسندگان
چکیده
A weak square in a binary word is a pair of adjacent non-empty blocks of the same length, having the same number of 1s. A weak circular square is a weak square which is possibly wrapped around the word: the tail protruding from the right end of the word reappears at the left end. Two weak circular squares are equivalent if they have the same length and contain the same number of ones. We prove that the longest word with only k inequivalent weak circular squares contains 4k + 2 bits and has the form (01) 2k+1 or its complement. Possible connections to tandem repeats in the human genome are pointed out.
منابع مشابه
Cyclically repetition-free words on small alphabets
All sufficiently long binary words contain a square but there are infinite binary words having only the short squares 00, 11 and 0101. Recently it was shown by J. Currie that there exist cyclically square-free words in a ternary alphabet except for lengths 5, 7, 9, 10, 14, and 17. We consider binary words all conjugates of which contain only short squares. We show that the number c(n) of these ...
متن کاملFacial expression recognition based on Local Binary Patterns
Classical LBP such as complexity and high dimensions of feature vectors that make it necessary to apply dimension reduction processes. In this paper, we introduce an improved LBP algorithm to solve these problems that utilizes Fast PCA algorithm for reduction of vector dimensions of extracted features. In other words, proffer method (Fast PCA+LBP) is an improved LBP algorithm that is extracted ...
متن کاملOn periodic properties of circular words
The conjugacy relation defines a partition of words into equivalence classes. We call these classes circular words. Periodic properties of circular words are investigated in this article. The Periodicity Theorem of Fine and Wilf does not hold for weak periods of circular words; instead we give a strict upper bound on the length of a non-unary circular word that has two given relatively prime we...
متن کاملDistinct Squares in Circular Words
A circular word, or a necklace, is an equivalence class under conjugation of a word. A fundamental question concerning regularities in standard words is bounding the number of distinct squares in a word of length n. The famous conjecture attributed to Fraenkel and Simpson is that there are at most n such distinct squares, yet the best known upper bound is 1.84n by Deza et al. [Discr. Appl. Math...
متن کاملOn Abelian Circular Squares in Binary Words1
To the memory of Paul Erdd os and to his living heritage Abstract. An abelian square in a binary word is a pair of adjacent non-empty blocks of the same length, having the same number of 1s. An abelian circular square is an abelian square which is possibly wrapped around the word: the tail protruding from the right end of the word reappears at the left end. Two abelian circular squares are equi...
متن کامل